Higher-Order Modal Logics: Automation and Applications
نویسندگان
چکیده
These are the lecture notes of a tutorial on higher-order modal logics held at the 11th Reasoning Web Summer School. After defining the syntax and (possible worlds) semantics of some higherorder modal logics, we show that they can be embedded into classical higher-order logic by systematically lifting the types of propositions, making them depend on a new atomic type for possible worlds. This approach allows several well-established automated and interactive reasoning tools for classical higher-order logic to be applied also to modal higherorder logic problems. Moreover, also meta reasoning about the embedded modal logics becomes possible. Finally, we illustrate how our approach can be useful for reasoning with web logics and expressive ontologies, and we also sketch a possible solution for handling inconsistent data.
منابع مشابه
Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning systems for simple type type theory exist that can be uniformly employed for reasoning within and about embedded logics. In this paper we focus on reasoning about modal logics and exploit our framework for the automated ve...
متن کاملEmbedding of Quantified Modal Logic in Higher Order Logic Seminar Paper on Expressive Logics and their Automation
Church’s Simple Theory of Types (STT, also referred to as classical higher-order logic) is an elegant and expressive formal language that can represent complex (higher-order) properties and formulae. In this paper, an encoding of second-order quantified modal logic (QML) in STT, due to C. Benzmüller and L. C. Paulsen, is discussed. Main results include the soundness and completeness of this enc...
متن کاملHOL based Universal Reasoning
At Unilog’2010 I have proposed classical higher-order logic HOL (Church’s type theory [1,9]) as a uniform framework for combining logics [2]. The main claim has been that many non-classical logics are just natural (embedded) fragments of classical HOL. The approach also supports combinations (e.g. fusions) of embedded logics; in particular, bridge rules can be postulated simply as axioms. In th...
متن کاملLogic Methods for Many-valued Logics: Higher-order Autoepistemic Language Concepts
The higher-order types of Herbrand interpretations for databases arise often in practice when we have to deal with uncertain or imprecise information, or in constrained databases. They are a consequence of the introduction of a kind of the observational equivalence for the hidden information in the ordinary Herbrand interpretations. It means that the logics for such databases are particular fun...
متن کاملMetareasoning for Multi-agent Epistemic Logics
We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then use Athena as a metalanguage in order to reason about the multi-agent logic an as object language. This facilitates theorem proving in the multi-agent logic in several ways. First, it lets us marshal the highly efficient theore...
متن کامل